Generation of Strongly Regular Graphs from Normalized Hadamard Matrices
نویسندگان
چکیده
This paper proposes an algorithm which can be used to construct strongly regular graphs from Hadamard matrices.A graph is strongly regular if there are integers and such that every two adjacent vertices have common neighbours and every two non adjacent vertices have common neighbors. Proposed method is mainly based on basic matrix manipulations. If the order of the normalized Hadamard matr ix is the resulting strongly regular graph will have number of vertices. Therefore the simplest strongly regular graph generated from this method has 16 vertices since its predecessor normalized Hadamard matrix has the order of 4. This algorithm was implemented using C++ programming language. Then the algorithm was tested for large Hadamard matrices and the results proved that this method is correct and works for any normalized Hadamard matrix of order greater than or equal to 4.
منابع مشابه
Complex Hadamard Matrices and Combinatorial Structures
Forty years ago, Goethals and Seidel showed that if the adjacency algebra of a strongly regular graph X contains a Hadamard matrix then X is of Latin square type or of negative Latin square type [8]. We extend their result to complex Hadamard matrices and find only three additional families of parameters for which the strongly regular graphs have complex Hadamard matrices in their adjacency alg...
متن کاملHadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property
A graph is 3-e.c. if for every 3-element subset S of the vertices, and for every subset T of S, there is a vertex not in S which is joined to every vertex in T and to no vertex in S \ T. Although almost all graphs are 3-e.c., the only known examples of strongly regular 3-e.c. graphs are Paley graphs with at least 29 vertices. We construct a new infinite family of 3-e.c. graphs, based on certain...
متن کاملTremain equiangular tight frames
We combine Steiner systems with Hadamard matrices to produce a new class of equiangular tight frames. This in turn leads to new constructions of strongly regular graphs and distance-regular antipodal covers of the complete graph.
متن کاملClassification of Small Class Association Schemes Coming from Certain Combinatorial Objects Table of Contents
We explore twoor three-class association schemes. We study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several specific classification problems. We work with s...
متن کاملUniform Mixing and Association Schemes
We consider continuous-time quantum walks on distance-regular graphs. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing. First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform mixing are the Paley graph of order nine and...
متن کامل